Minimal Sufficient Conditions for Structural Observability/Controllability of Composite Networks via Kronecker Product

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Kronecker Product and Stochastic Automata Networks

This paper can be thought of as a companion paper to Van Loan’s The Ubiquitous Kronecker Product paper [23]. We collect and catalog the most useful properties of the Kronecker product and present them in one place. We prove several new properties that we discovered in our search for a Stochastic Automata Network preconditioner. We conclude by describing one application of the Kronecker product,...

متن کامل

Sufficient conditions for univalence and starlikeness

It is known that the condition $mathfrak {Re} left{zf'(z)/f(z)right}>0$, $|z|

متن کامل

Sufficient Conditions for Conservativity of Minimal Quantum Dynamical Semigroups

The conservativity of a minimal quantum dynamical semigroup is proved whenever there exists a " reference " subharmonic operator bounded from below by the dissipative part of the infinitesimal generator. We discuss applications of this criteria in mathematical physics and quantum probability. 1. Introduction A quantum dynamical semigroup (q.d.s.) T = (T t) t≥0 on B(h), the Banach space of bound...

متن کامل

Sufficient conditions for Hamiltonicity in multiswapped networks

OTIS networks are interconnection networks amenable to deployment as hybrid networks containing both electronic and optical links. Deficiencies as regards symmetry led to the subsequent formulation of biswapped networks which were later generalized to multiswapped networks so as to still enable optoelectronic implementation (as it happens, multiswapped networks also generalize previously studie...

متن کامل

Sufficient conditions for convergence of the Sum-Product Algorithm

Novel conditions are derived that guarantee convergence of the Sum-Product algorithm (also known as Loopy Belief Propagation or simply Belief Propagation) to a unique fixed point, irrespective of the initial messages, for parallel (synchronous) updates. The computational complexity of the conditions is polynomial in the number of variables. In contrast with previously existing conditions, our r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal and Information Processing over Networks

سال: 2020

ISSN: 2373-776X,2373-7778

DOI: 10.1109/tsipn.2019.2960002